Approximation and online algorithms (Third international workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005)Erlebach, Thomas; Persinao, Giuseppe.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-32207-8, 1Vol, X-347 p, isbn 3-540-32207-8Conference Proceedings

A better-than-greedy algorithm for k-set multicoverFUJITO, Toshihiro; KURAHASHI, Hidekazu.Lecture notes in computer science. 2006, pp 176-189, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

Approximation and complexity of k-splittable flowsKOCH, Ronald; SKUTELLA, Martin; SPENKE, Ines et al.Lecture notes in computer science. 2006, pp 244-257, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

On approximating restricted ycle coversMANTHEY, Bodo.Lecture notes in computer science. 2006, pp 282-295, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

On the minimum load coloring problem : Extended abtractAHUJA, Nitin; BALTZ, Andreas; DOERR, Benjamin et al.Lecture notes in computer science. 2006, pp 15-26, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 12 p.Conference Paper

Improved approximation algorithms for MAX NAE-SAT and MAX SATAVIDOR, Adi; BERKOVITCH, Ido; ZWICK, Uri et al.Lecture notes in computer science. 2006, pp 27-40, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

On minimizing the maximum flow time in the online dial-a-ride problemKRUMKE, Sven O; DE PAEPE, Willem E; POENSGEN, Diana et al.Lecture notes in computer science. 2006, pp 258-269, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 12 p.Conference Paper

Improved approximation algorithm for convex recoloring of treesBAR-YEHUDA, Reuven; FELDMAN, Ido; RAWITZ, Dror et al.Lecture notes in computer science. 2006, pp 55-68, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

Online removable square packingXIN HAN; IWAMA, Kazuo; GUOCHUAN ZHANG et al.Lecture notes in computer science. 2006, pp 216-229, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

SONET ADMs minimization with divisible pathsEPSTEIN, Leah; LEVIN, Asaf.Lecture notes in computer science. 2006, pp 119-132, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

Speed scaling of tasks with precedence constraintsPRUHS, Kirk; VAN STEE, Rob; UTHAISOMBUT, Patchrawat et al.Lecture notes in computer science. 2006, pp 307-319, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 13 p.Conference Paper

The hardness of network design for unsplittable flow with selfish usersAZAR, Yossi; EPSTEIN, Amir.Lecture notes in computer science. 2006, pp 41-54, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

A note on semi-online machine coveringEBENLENDR, Tomas; NOGA, John; SGALL, Jiri et al.Lecture notes in computer science. 2006, pp 110-118, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 9 p.Conference Paper

Approximate fair cost allocation in metric traveling salesman gamesBLÄSER, M; SHANKAR RAM, L.Lecture notes in computer science. 2006, pp 82-95, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

Exploiting locality : Approximating sorting buffersBAR-YEHUDA, Reuven; LASERSON, Jonathan.Lecture notes in computer science. 2006, pp 69-81, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 13 p.Conference Paper

Improvements for truthful mechanisms with verifiable one-parameter selfish agentsFERRANTE, A; PARLATO, G; SORRENTINO, F et al.Lecture notes in computer science. 2006, pp 147-160, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

Rounding of sequences and matrices, with applicationsDOERR, Benjamin; FRIEDRICH, Tobias; KLEIN, Christian et al.Lecture notes in computer science. 2006, pp 96-109, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

Tighter approximations for maximum induced matchings in regular graphsGOTTHILF, Zvi; LEWENSTEIN, Moshe.Lecture notes in computer science. 2006, pp 270-281, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 12 p.Conference Paper